Using Computer Algebra to Choose and Apply Numerical Routines
نویسنده
چکیده
In applied mathematics, electronic and chemical engineering, the modelling process can produce a number of mathematical problems which require numerical solutions for which symbolic methods are either not possible or not obvious. With the plethora of numerical library routines for the solution of these problems often the numerical analyst has to answer the question Which routine to choose? and How do I use it? Some analysis needs to be carried out before the appropriate routine can be identiied i.e. How stii is this ODE? and Is this function continuous? It may well be the case that more than one routine is applicable to the problem. So the question may become Which is likely to be the best? Such a choice may be critical for both accuracy and eeciency. An expert system is thus required to make this choice based on the result of its own analysis of the problem, call the routine and act on the outcome. This may be to put the answer in a relevant form or react to an apparent failure of the chosen routine and thus choose and call an alternative. It should also have suucient explanation mechanisms to inform on the choice of routine and the reasons for that choice. Much of this work can be achieved using computer algebra and symbolic algebra packages. This paper describes an expert system currently in prototype in terms of both its object-based structure and its computational agents. Some of these agents are described in detail, paying particular attention to the practical aspects of their algorithms and the use of computer algebra. The axi. om2 y Symbolic Algebra System is used as a user interface as well as the link to the NAG Foundation Library for the numerical routines and the inference mechanisms for the expert system.
منابع مشابه
PROCRUSTES: A computer algebra package for post-Newtonian calculations in General Relativity
We report on a package of routines for the computer algebra system Maple which supports the explicit determination of the geometric quantities, field equations, equations of motion, and conserved quantities of General Relativity in the postNewtonian approximation. The package structure is modular and allows for an easy modification by the user. The set of routines can be used to verify hand cal...
متن کاملNumerically Stable Optimization of Polynomial Solvers for Minimal Problems
Numerous geometric problems in computer vision involve the solution of systems of polynomial equations. This is particularly true for so called minimal problems, but also for finding stationary points for overdetermined problems. The state-of-the-art is based on the use of numerical linear algebra on the large but sparse coefficient matrix that represents the original equations multiplied with ...
متن کاملCtadel: A Generator of Efficient Numerical Codes Ctadel: A Generator of Efficient Numerical Codes
Algorithm Templates. According to Kant and Steinberg [82], linear solvers and related algorithms can be cast in the form of so-called algorithm templates. Templates are algebraic structures that capture the essentials of an algorithm, elaborated with problem-specific aspects, and can be transformed into a chosen target language. The SciNapse system [2] uses algorithm templates in the automatic ...
متن کاملParallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
The Numerical Algorithms Group Ltd is currently partic ipating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Libraries PINEAPL One of the main goals of the project is to increase the suitability of the existing NAG Parallel Library for dealing with computationally in tensive industrial applications by appropriately extending the range o...
متن کاملOn the Design, Development, and Analysis of Optimized Matrix-Vector Multiplication Routines for Coprocessors
The dramatic change in computer architecture due to the manycore paradigm shift, made the development of numerical routines that are optimal extremely challenging. In this work, we target the development of numerical algorithms and implementations for Xeon Phi coprocessor architecture designs. In particular, we examine and optimize the general and symmetric matrix-vector multiplication routines...
متن کامل